Computational Indistinguishability between Quantum States and Its Cryptographic Application

We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is "secure" against any polynomial-time quantum adversary. Our problem, QSCDff, is to distinguish between two types of random coset states with a hidden permutation over the symmetric group of finite degree. This naturally generalizes the commonly-used distinction problem between two probability distributions in computational cryptography. As our major contribution, we show that QSCDff has three properties of cryptographic interest: (i) QSCDff has a trapdoor; (ii) the average-case hardness of QSCDff coincides with its worst-case hardness; and (iii) QSCDff is computationally at least as hard as the graph automorphism problem in the worst case. These cryptographic properties enable us to construct a quantum public-key cryptosystem, which is likely to withstand any chosen plaintext attack of a polynomial-time quantum adversary. We further discuss a generalization of QSCDff, called QSCDcyc, and introduce a multi-bit encryption scheme that relies on similar cryptographic properties of QSCDcyc.Comment: 24 pages, 2 figures. We improved presentation, and added more detail proofs and follow-up of recent wor

Comparison of five commercial serological tests for the detection of anti-Chlamydia trachomatis antibodies.

Screening for Chlamydia trachomatis-specific antibodies is valuable in investigating recurrent miscarriage, tubal infertility and extrauterine pregnancy. We compared here the performance of immunofluorescence (IF) to four other commercial tests in detecting IgG antibodies directed against C. trachomatis: two enzyme-linked immunosorbent assays (ELISAs) using the major outer membrane protein (MOMP) as the antigen, commercialised respectively by Medac and R-Biopharm (RB), one ELISA using the chlamydial heat shock protein 60 (cHSP60) as the antigen (Medac), as well as a new automated epifluorescence immunoassay (InoDiag). A total of 405 patients with (n = 251) and without (n = 154) miscarriages were tested by all five tests. The prevalence of C. trachomatis-specific IgG antibodies as determined by the IF, cHSP60-Medac, MOMP-Medac, MOMP-RB and InoDiag was 14.3, 23.2, 14.3, 11.9 and 26.2%, respectively. InoDiag exhibited the highest sensitivity, whereas MOMP-RB showed the best specificity. Cross-reactivity was observed with C. pneumoniae using IF, MOMP-RB and InoDiag, and Parachlamydia acanthamoebae using the cHSP60 ELISA test. No cross-reactivity was observed between C. trachomatis and the other Chlamydiales (Neochlamydia hartmannellae, Waddlia chondrophila and Simkania negevensis). Given its high sensitivity, the new automated epifluorescence immunoassay from InoDiag represents an interesting alternative. The MOMP-based ELISA of R-Biopharm should be preferred for large serological studies, given the high throughput of ELISA and its excellent specificity

Hierarchical Unambiguity

Abstract. We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to push forward some known constructs involving relativized unambiguity based complexity classes (UP and Promise-UP) to new constructs involving arbitrary levels of the relativized unambiguous polynomial hierarchy (UPH). Our techniques are developed on constraints imposed by hierarchical assembly of unambiguous nondeterministic polynomial-time Turing machines, and so our techniques differ substantially, in applicability and in nature, from standard techniques (such as the switching lemma [H˚as87]), which are known to play roles in carrying out similar generalizations. Aside from achieving these generalizations, we resolve a question posed by Cai, Hemachandra, and Vyskoč [CHV93] on an issue related to nonadaptive Turing access to UP and adaptive smart Turing access to Promise-UP.